The Share-A-Ride Problem with Integrated Routing and Design Decisions: The Case of Mixed-Purpose Shared Autonomous Vehicles

The shared autonomous vehicle (SAV) is a new concept that meets the upcoming trends of driving and changing demands in urban transportation. SAVs can carry passengers parcels simultaneously, making use dedicated passenger parcel modules on board. A fleet could partly take over private transport, taxi, last-mile delivery services. reduced size compared to conventional transportation modes would lead less traffic congestion centres. This paper presents method estimate optimal capacity for compartments SAVs. problem presented as routing named variable share-a-ride-problem (VCSARP). model has MILP formulation solved using commercial solver. It seeks create schedule between randomly generated set pick-up drop-off requests parcels. objective function aims minimize total energy costs each schedule, which trade-off travelled distance capacity. Different scenarios are composed by altering parameters, representing travel demand at different times day. results show optimized cost simulation along with associated routes capacities.